Improved Non-Approximability Results for Minimum Vertex Cover with Density Constraints

نویسندگان

  • Andrea E. F. Clementi
  • Luca Trevisan
چکیده

We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that for a suuciently large B, the recent 16/15 lower bound proved by Bellare et al. 5] extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we show a similar result but with a better trade-oo between non-approximability and sparsity. Finally we observe that the Min Vertex Cover problem remains APX-complete when restricted to dense graph and thus recent techniques developed for several Max SNP problems restricted to \dense" instances introduced by Arora et al. 2] cannot be applied.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved Non-approximability Results for Vertex Cover with Density Constraints

We provide new non-approximability results for the restrictions of the Min Vertex Cover problem to bounded-degree, sparse and dense graphs. We show that, for a suuciently large B, the recent 16/15 lower bound proved by Bellare et al. 3] extends with negligible loss to graphs with bounded degree B. Then, we consider sparse graphs with no dense components (i.e. everywhere sparse graphs), and we s...

متن کامل

On Approximation Hardness of the Minimum 2SAT-DELETION Problem

The Minimum 2SAT-Deletion problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems [8], and its approximability is largely open. We prove a lower approximation bound of 8 √ 5 − 15 ≈ 2.88854, improving the previous bound of 10 √ 5 − 21 ≈ 1.36067 by Dinur and Safra [5]. For h...

متن کامل

Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover

The MINIMUM 2SAT-DELETION problem is to delete the minimum number of clauses in a 2SAT instance to make it satisfiable. It is one of the prototypes in the approximability hierarchy of minimization problems Khanna et al. [Constraint satisfaction: the approximability of minimization problems, Proceedings of the 12th Annual IEEE Conference on Computational Complexity, Ulm, Germany, 24–27 June, 199...

متن کامل

On Approximability of the Independent/Connected Edge Dominating Set Problems

We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit-weighted, the edge dominating set problem is polynomially equivalent to the minimum maximal matching problem, in either exact or approximate computation, and the former problem was recently found to be approximable within a factor of 2 even with arbitrary weights. It wil...

متن کامل

Approximating Subdense Instances of Covering Problems

We study approximability of subdense instances of various covering problems on graphs, defined as instances in which the minimum or average degree is Ω(n/ψ(n)) for some function ψ(n) = ω(1) of the instance size. We design new approximation algorithms as well as new polynomial time approximation schemes (PTASs) for those problems and establish first approximation hardness results for them. Inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 3  شماره 

صفحات  -

تاریخ انتشار 1996